Strength and Weakness in Grover’s Quantum Search Algorithm
نویسنده
چکیده
Grover’s quantum search algorithm is considered as one of the milestone in the field of quantum computing. The algorithm can search for a single match in a database with N records in O( √ N) assuming that the item must exist in the database with quadratic speedup over the best known classical algorithm. This review paper discusses the performance of Grover’s algorithm in case of multiple matches where the problem is expected to be easier. Unfortunately, we will find that the algorithm will fail for M > 3N/4, where M is the number of matches in the list.
منابع مشابه
Grover’s algorithm and human memory
In this article we consider an experimental study showing the influence of emotion regulation strategies on human memory performance: part of such experimental results are difficult to explain within a classic cognitive allocation model. We provide a first attempt to build a model of human memory processes based on a quantum algorithm, the Grover’s algorithm, which allows to search a particular...
متن کاملAn information-theoretic analysis of Grover’s algorithm
Grover discovered a quantum algorithm for identifying a target element in an unstructured search universe of N items in approximately π/4 √ N queries to a quantum oracle. For classical search using a classical oracle, the search complexity is of order N/2 queries since on average half of the items must be searched. In work preceding Grover’s, Bennett et al. had shown that no quantum algorithm c...
متن کاملQuantum Searching: A survey of Grover’s Algorithm and its Descendants
One of computer science’s classic problems is that of the search. This paper will look at Lou K. Grover’s Quantum Search algorithm. This algorithm is used to search a database, or search space, that is not, and cannot be, sorted or structured. It can produce a quadratic speed up over any similar classical search. This paper will also look at some of the issues and advances that have come out of...
متن کاملDeterministic Application of Grover's Quantum Search Algorithm
Grover’s quantum search algorithm finds one of t solutions in N candidates by using (π/4) √ N/t basic steps. It is, however, necessary to know the number t of solutions in advance for using the Grover’s algorithm directly. On the other hand, Boyer etal proposed a randomized application of Grover’s algorithm, which runs, on average, in O( √ N/t) basic steps (more precisely, (9/4) √ N/t steps) wi...
متن کاملSimulation of Grover’s quantum search algorithm in a Ising nuclear spin chain quantum computer with first and second nearest neighbour couplings
We implement Grover’s quantum search algorithm on a nuclear spin chain quantum computer, taking into Ising type interactions between nearest and second nearest neighbours into account. The performance of the realisation of the algorithm is studied by numerical simulations with four spins. We determine the temporal behaviour of the fidelity during the algorithm, and we compute the final fidelity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008